/*************************************************************************
	> File Name: P1304.cpp
	> Author: yufangze
	> Mail: 2224590123@qq.com
	> Created Time: 2025-02-11 10:06:44
 ************************************************************************/

#include <iostream>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;

int is_prime(int n) {
    for (int i = 2; i <= sqrt(n); i++) {
        if (n % i == 0) return 0;
    }
    return 1;
}

void solve(int n, int &a, int &b) {
    for (int i = 2; i <= n / 2; i++) {
        if (!is_prime(i)) continue;
        int j = n - i;
        if (!is_prime(j)) continue;
        a = i, b = j;
        break;
    }
    return ;
}

int main() {
    int n;
    cin >> n;
    for (int i = 4, a, b; i <= n; i += 2) {
        solve(i, a, b);
        printf("%d=%d+%d\n", i, a, b);
    }
    return 0;
}
